Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
نویسندگان
چکیده
منابع مشابه
Cutting Plane Algorithms for Integer Programming, Cutting Plane Algorithms
Cutting plane methods are exact algorithms for integer programming problems. They have proven to be very useful computationally in the last few years, especially when combined with a branch and bound algorithm in a branch and cut framework. These methods work by solving a sequence of linear programming relax-ations of the integer programming problem. The relaxations are gradually improved to gi...
متن کاملA linear algorithm for integer programming in the plane
We show that a 2-variable integer program, defined by m constraints involving coefficients with at most φ bits can be solved with O(m+φ) arithmetic operations on rational numbers of size O(φ).
متن کاملA two-stage approach for bi-objective integer linear programming
We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, ...
متن کاملA New Sequential Cutting Plane Algorithm for Solving Mixed Integer Nonlinear Programming Problems
This paper presents a new algorithm for solving mixed integer nonlinear programming problems. The algorithm uses a branch and bound strategy where a nonlinear programming problem is solved in each integer node of the tree. The nonlinear programming problems, at each integer node of the tree, are not solved to optimality, rather one iteration step is taken at each node and then linearizations of...
متن کاملA computational study of the cutting plane tree algorithm for general mixed-integer linear programs
The cutting plane tree (CPT) algorithm provides a finite disjunctive programming procedure to obtain the solution of general mixed-integer linear programs (MILP) with bounded integer variables. In this paper, we present our computational experience with variants of the CPT algorithm. Because the CPT algorithm is based on discovering multi-term disjunctions, this paper is the first to present co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2020
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-020-00459-6